<HTML><HEAD><TITLE>library(bfs)</TITLE></HEAD><BODY>
[ <A HREF="../../index.html">Reference Manual</A> | <A HREF="../../fullindex.html">Alphabetic Index</A> ]<H1>library(bfs)</H1>
Best-first search library
<H2>Predicates</H2>
<BLOCKQUOTE>
<DL>
<DT><A HREF="bfs_branch-1.html"><STRONG>BfsInstance:bfs_branch(+Branch)</STRONG></A></DT>
<DD>Post a branching constraint to the bfs instance BfsInstance.</DD>
<DT><STRONG>bfs_branch(?, ?)</STRONG></DT>
<DD>No description available</DD>
<DT><STRONG>bfs_branch(?, ?, ?)</STRONG></DT>
<DD>No description available</DD>
<DT><STRONG>bfs_deg_est(?, ?)</STRONG></DT>
<DD>No description available</DD>
<DT><STRONG>bfs_enhanced(?, ?)</STRONG></DT>
<DD>No description available</DD>
<DT><STRONG>bfs_fracvar(?)</STRONG></DT>
<DD>No description available</DD>
<DT><STRONG>bfs_get(?, ?, ?)</STRONG></DT>
<DD>No description available</DD>
<DT><STRONG>bfs_global_cut(?, ?)</STRONG></DT>
<DD>No description available</DD>
<DT><STRONG>bfs_impose_node_state(?, ?)</STRONG></DT>
<DD>No description available</DD>
<DT><A HREF="bfs_instance-1.html"><STRONG>bfs_instance(++BfsInstance)</STRONG></A></DT>
<DD>Initialises the bfs instance BfsInstance.</DD>
<DT><STRONG>bfs_integers(?, ?)</STRONG></DT>
<DD>No description available</DD>
<DT><STRONG>bfs_minimize_eplex_node(?, ?)</STRONG></DT>
<DD>No description available</DD>
<DT><STRONG>bfs_node_cost(?, ?)</STRONG></DT>
<DD>No description available</DD>
<DT><STRONG>bfs_node_info(?, ?, ?)</STRONG></DT>
<DD>No description available</DD>
<DT><STRONG>bfs_node_info(?, ?, ?, ?, ?, ?)</STRONG></DT>
<DD>No description available</DD>
<DT><STRONG>bfs_set(?, ?, ?)</STRONG></DT>
<DD>No description available</DD>
<DT><STRONG>bfs_solve(?, ?)</STRONG></DT>
<DD>No description available</DD>
<DT><STRONG>bfs_solver_setup(?, ?, ?)</STRONG></DT>
<DD>No description available</DD>
<DT><STRONG>bfs_solver_setup(?, ?, ?, ?)</STRONG></DT>
<DD>No description available</DD>
<DT><STRONG>bfs_statistics(?)</STRONG></DT>
<DD>No description available</DD>
<DT><STRONG>bfs_strong(?, ?)</STRONG></DT>
<DD>No description available</DD>
<DT><STRONG>bfs_update_pseudocosts(?)</STRONG></DT>
<DD>No description available</DD>
<DT><STRONG>bfs_var_get(?, ?, ?, ?)</STRONG></DT>
<DD>No description available</DD>
<DT><A HREF="get-2.html"><STRONG>BfsInstance:get(++What, -Value)</STRONG></A></DT>
<DD>Obtain information for the problem associated with BfsInstance.</DD>
<DT><A HREF="integers-1.html"><STRONG>BfsInstance:integers(+Ints)</STRONG></A></DT>
<DD>Declare Ints as integers in BfsInstance.</DD>
<DT><A HREF="node_cost-1.html"><STRONG>BfsInstance:node_cost(+Val)</STRONG></A></DT>
<DD>Set solution cost for the problem at a node.</DD>
<DT><A HREF="node_info-5.html"><STRONG>BfsInstance:node_info(+Var, ?Lo, ?Hi, ?Val, ?RC)</STRONG></A></DT>
<DD>Get or set node bounds and solution information for an individual solver problem variable Var.</DD>
<DT><A HREF="solve-1.html"><STRONG>BfsInstance:solve(-Cost)</STRONG></A></DT>
<DD>Optimise the problem associated with BfsInstance.</DD>
<DT><A HREF="solver_setup-2.html"><STRONG>BfsInstance:solver_setup(+OptSense, +Solver)</STRONG></A></DT>
<DD>Setup a bfs solver tree for bfs instance BfsInstance.</DD>
<DT><A HREF="solver_setup-3.html"><STRONG>BfsInstance:solver_setup(+OptSense, +Solver, ++ListOfOptions)</STRONG></A></DT>
<DD>Setup a bfs solver tree for bfs instance BfsInstance.</DD>
<DT><A HREF="statistics-0.html"><STRONG>BfsInstance:statistics</STRONG></A></DT>
<DD>Display search tree statistics for bfs instance BfsInstance.</DD>
<DT><A HREF="var_get-3.html"><STRONG>BfsInstance:var_get(+Var, ++What, -Value)</STRONG></A></DT>
<DD>Obtain information for an individual solver problem variable Var.</DD>
</DL>
</BLOCKQUOTE>
<H2>Description</H2>
<P>
   This library lets you use customisable branch-and-bound search. It
   is primarily intended for use with the colgen library in implementing
   branch-and-price algorithms, but can be used with arbitrary
   user-defined node solution, separation and selection goals.
   When application specific methods are not required for node
   separation and/or selection the use of built-in depth-first
   and best-first node selection, and branching on most fractional
   variable or generalised upper bound constraint may be specified.
   When the relaxed problem to be solved at a node involves an eplex
   instance branching may additionally be specified by built-in
   objective coefficient, estimate- or lower-bounding based methods,
   and best-estimate node selection may be used.
</P>

<H2>About</H2><UL COMPACT>
<LI><STRONG>Status: </STRONG>prototype
<LI><STRONG>Author: </STRONG>Andrew Eremin
<LI><STRONG>Copyright &copy; </STRONG>Cisco Systems, Inc.
<LI><STRONG>Date: </STRONG>$Date: 2009/02/19 05:45:20 $
</UL>
<HR>Generated from bfs.eci on 2009-05-27 01:25
</BODY></HTML>
